منابع مشابه
Determinants and permanents of Hessenberg matrices and generalized Lucas polynomials
In this paper, we give some determinantal and permanental representations of generalized Lucas polynomials, which are a general form of generalized bivariate Lucas p-polynomials, ordinary Lucas and Perrin sequences etc., by using various Hessenberg matrices. In addition, we show that determinant and permanent of these Hessenberg matrices can be obtained by using combinations. Then we show, the ...
متن کاملConcerning Hausdorff Matrices and Absolutely Convergent Sequences1
for£}=0, 1,2,.... This paper is concerned with the determination of those generalized Hausdorff matrices which sum all absolutely convergent sequences. Theorem 2 gives a sufficiency condition stated in terms of the behavior of the points of continuity of the graph of g and Theorems 3 and 4 provide examples which serve to further describe functions which generate such matrices. Theorem 5 gives a...
متن کاملHausdorff Matrices as Bounded Operators over /
A necessary and sufficient condition is obtained for an arbitrary Hausdorff matrix to belong to B(l). It is then shown that every conservative quasi-Hausdorff matrix is of type M. Let (H, u) denote the Hausdorff method with generating sequence ¡x = {/L,}, / = {{xn} \2„\xn\ < oo}, B(l) the algebra of bounded linear operators on /. A necessary and sufficient condition is obtained for an arbitrary...
متن کاملGegenbauer Polynomials and Semiseparable Matrices
In this paper, we develop a new O(n logn) algorithm for converting coefficients between expansions in different families of Gegenbauer polynomials up to a finite degree n. To this end, we show that the corresponding linear mapping is represented by the eigenvector matrix of an explicitly known diagonal plus upper triangular semiseparable matrix. The method is based on a new efficient algorithm ...
متن کاملMinimal Polynomials of Matrices
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n) field operations and O(n) random vectors, and is well suited for successful practical implementation. The algorithm, and its complexity analysis, use standard algorithms for polynomial and matrix operations. We compare features of the algorithm with several ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1974
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1974.50.613